Optimally Quantized and Smoothed Histograms

نویسندگان

  • Mingzhou Song
  • Robert M. Haralick
چکیده

We propose an approach using optimal quantization and smoothing to generate adaptive histograms for multi-class one dimensional data. The discretization of data is optimal in maximizing a quantizer performance measure, defined by a combination of average log likelihood, entropy and correct classification probability. The optimal partition is found by dynamic programming. The density of each bin is obtained by a smoothing technique that can be considered a generalized k nearest neighbor density estimation algorithm. However, our smoothing approach is much more efficient. Experimental results demonstrated the effectiveness of the optimally quantized and smoothed histograms. Even though obtaining one takes about quadratic time in sample size, an optimal histogram is much more efficient to use than typical kernel methods. Therefore, optimal histograms are more suitable in applications with massive data set.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Local Primitive Histograms for Patent Binary Image Retrieval

Local primitives are useful in the analysis, recognition and retrieval of document and patent images. In this paper, local primitives are classified in 4 and 8-directional spaces at optimally detected junction and end points by using a distance based approach. Local primitives are quantized by using a variant of Local Binary Patterns. Spatial relationships between local primitives are establish...

متن کامل

Innovative Methodology Quantification and classification of neuronal responses in kernel-smoothed peristimulus time histograms

Hill MR, Fried I, Koch C. Quantification and classification of neuronal responses in kernel-smoothed peristimulus time histograms. J Neurophysiol 113: 1260–1274, 2015. First published December 4, 2014; doi:10.1152/jn.00595.2014.—Peristimulus time histograms are a widespread form of visualizing neuronal responses. Kernel convolution methods transform these histograms into a smooth, continuous pr...

متن کامل

Hierarchical partition priority wavelet image compression

Image compression methods for progressive transmission using optimal hierarchical decomposition, partition priority coding (PPC), and multiple distribution entropy coding (MDEC) are presented. In the proposed coder, a hierarchical subband/wavelet decomposition transforms the original image. The analysis filter banks are selected to maximize the reproduction fidelity in each stage of progressive...

متن کامل

Using Smoothed Data Histograms for Cluster Visualization in Self-Organizing Maps

Several methods to visualize clusters in high-dimensional data sets using the Self-Organizing Map (SOM) have been proposed. However, most of these methods only focus on the information extracted from the model vectors of the SOM. This paper introduces a novel method to visualize the clusters of a SOM based on smoothed data histograms. The method is illustrated using a simple 2-dimensional data ...

متن کامل

Quantification and classification of neuronal responses in kernel-smoothed peristimulus time histograms.

Peristimulus time histograms are a widespread form of visualizing neuronal responses. Kernel convolution methods transform these histograms into a smooth, continuous probability density function. This provides an improved estimate of a neuron's actual response envelope. We here develop a classifier, called the h-coefficient, to determine whether time-locked fluctuations in the firing rate of a ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002